Key Generation in Elliptic Curve Cryptosystems over GF ( 2 n )
نویسنده
چکیده
This paper proposes a public key generation for an ECC (Elliptic Curve Cryptosystem) using FPGA’s. To improve the strength of encryption and the speed of processing, the public key and the private key of EC(Elliptic curve) over GF(2) are used to form a shared private key (X,Y). And then the X is used with an initial point on HEC(Hyper-Elliptic Curve) over GF(2) to generate session keys, which are used with 3BC (Block Byte Bit Cipher) algorithm for the data encryption. We are investigating a novel approach of software/ hardware co-design implemented in Verilog Hardware Description Language (VHDL), which produces hardware algorithm components to place onto the FPGAs, thereby creating adaptive software overlays differentiated by use of a Universal Unique Identifier (UUID) as a functional operand to a custom arithmetic Logic Unit (ALU).1
منابع مشابه
Efficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملElliptic Curve Cryptosystems
We discuss analogs based on elliptic curves over finite fields of public key cryptosystems which use the multiplicative group of a finite field. These elliptic curve cryptosystems may be more secure, because the analog of the discrete logarithm problem on elliptic curves is likely to be harder than the classical discrete logarithm problem, especially over GF(2"). We discuss the question of prim...
متن کاملA Small and Fast Software Implementation of Elliptic Curve Cryptosystems over GF (p) on a 16-Bit Microcomputer
Recently the study and implementation of elliptic curve cryptosystems (ECC) have developed rapidly and its achievements have become a center of attraction. ECC has the advantage of high-speed processing in software even on restricted environments such as smart cards. In this paper, we concentrate on complete software implementation of ECC over a prime field on a 16-bit microcomputer M16C (10MHz...
متن کاملOptimized quantum implementation of elliptic curve arithmetic over binary fields
Shor’s quantum algorithm for discrete logarithms applied to elliptic curve groups forms the basis of a “quantum attack” of elliptic curve cryptosystems. To implement this algorithm on a quantum computer requires the efficient implementation of the elliptic curve group operation. Such an implementation requires we be able to compute inverses in the underlying field. In [PZ03], Proos and Zalka sh...
متن کاملAn efficient blind signature scheme based on the elliptic curve discrete logarithm problem
Elliptic Curve Cryptosystems (ECC) have recently received significant attention by researchers due to their high performance such as low computational cost and small key size. In this paper a novel untraceable blind signature scheme is presented. Since the security of proposed method is based on difficulty of solving discrete logarithm over an elliptic curve, performance of the proposed scheme ...
متن کامل